Online scheduling of incompatible unit-length job families with lookahead
نویسندگان
چکیده
منابع مشابه
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines. The execution of any task on its corresponding machine takes exactly one time unit. The objective is to minimize the overall completion time, called makespan. The contribution of this paper are the following results: (i...
متن کاملOnline Scheduling with Lookahead: Multipass Assembly Lines
This paper describes our use of competitive analysis and the on-line model of computation in a product development setting; speciically, we use competitive analysis to evaluate on-line scheduling strategies for controlling a new generation of networked reprographic machines (combination printer-copier-fax machines servicing a network) currently being developed by companies such as Xerox Corpora...
متن کاملHeuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent de...
متن کاملAlgorithms for scheduling incompatible job families on single batching machine with limited capacity
Article history: Received 3 May 2012 Received in revised form 21 February 2013 Accepted 20 June 2014 Available online 30 June 2014
متن کاملScheduling Algorithms and Sensitivity Analysis for Heterogeneous Batch Processors with Incompatible Job Families
We consider the problem of scheduling heterogeneous batch processor under the conditions non-identical job sizes, dynamic job arrivals and incompatible job families. The problem studied in this paper is motivated by heat-treatment operations in the pre-casting stage of steel casting manufacturing. We proposed a few heuristic algorithms with maximizing the average utilization of batch processors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.05.024